An unavoidable set of configurations in planar triangulations
نویسندگان
چکیده
منابع مشابه
An Unavoidable Set of D-Reducible Configurations
We give a new proof of the four-color theorem by exhibiting an unavoidable set of 2822 D-reducible configurations. The existence of such a set had been conjectured by several researchers including Stromquist [18], Appel and Haken [2] and Robertson, Sanders, Seymour and Thomas [15].
متن کاملUnavoidable Multicoloured Families of Configurations
Balogh and Bollobás [Combinatorica 25, 2005] prove that for any k there is a constant f(k) such that any set system with at least f(k) sets reduces to a k-star, an k-costar or an k-chain. They proved f(k) < (2k)2 k . Here we improve it to f(k) < 2ck 2 for some constant c > 0. This is a special case of the following result on the multi-coloured forbidden configurations at 2 colours. Let r be giv...
متن کاملUnavoidable set of face types for planar maps
The type of a face f of a planar map is a sequence of degrees of vertices of f as they are encountered when traversing the boundary of f . A set T of face types is found such that in any normal planar map there is a face with type from T . The set T has four infinite series of types as, in a certain sense, the minimum possible number. An analogous result is applied to obtain new upper bounds fo...
متن کاملCounting Triangulations of Configurations
Calculating the number of Euclidean triangulations of a convex polygon P with vertices in a finite subset C ⊂ R2 containing all vertices of P seems to be difficult and has attracted some interest, both from an algorithmic and a theoretical point of view, see for instance [1], [2], [3], [4], [5], [7], [9], [10], [11]. The aim of this paper is to describe a class of configurations, convex near-go...
متن کاملEven Triangulations of Planar Set of Points with Steiner Points
Let P ⊂ R be a set of n points of which k are interior points. Let us call a triangulation T of P even if all its vertices have even degree, and pseudo-even if at least the k interior vertices have even degree. (Pseudo-) Even triangulations have one nice property; their vertices can be 3-colored, see [2, 3, 4]. Since one can easily check that for some sets of points, such triangulation do not e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1979
ISSN: 0095-8956
DOI: 10.1016/0095-8956(79)90038-8